A 1.75 LP approximation for the Tree Augmentation Problem

نویسندگان

  • Guy Kortsarz
  • Zeev Nutov
چکیده

In the Tree Augmentation Problem (TAP) the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪F is 2-edge-connected. The best approximation ratio known for TAP is 1.5. In the more general Weighted TAP problem, F should be of minimum weight. Weighted TAP admits several 2-approximation algorithms w.r.t. to the standard cut LP-relaxation, but for all of them the performance ratio of 2 is tight even for TAP. The problem is equivalent to the problem of covering a laminar set family. Laminar set families play an important role in the design of approximation algorithms for connectivity network design problems. In fact, Weighted TAP is the simplest connectivity network design problem for which a ratio better than 2 is not known. Improving this “natural” ratio is a major open problem, which may have implications on many other network design problems. It seems that achieving this goal requires finding an LP-relaxation with integrality gap better than 2, which is a long time open problem even for TAP. In this paper we introduce such an LP-relaxation and give an algorithm that computes a feasible solution for TAP of size at most 1.75 times the optimal LP value. This gives some hope to break the ratio 2 for the weighted case. Our algorithm computes some initial edge set by solving a partial system of constraints that form the integral edge-cover polytope, and then applies local search on 3-leaf subtrees to exchange some of the edges and to add additional edges. Thus we do not need to solve the LP, and the algorithm runs roughly in time required to find a minimum weight edge-cover in a general graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LP-relaxations for tree augmentation

In the Tree Augmentation problem the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪ F is 2-edge-connected. The best approximation ratio known for the problem is 1.5. In the more general Weighted Tree Augmentation problem, F should be of minimum weight. Weighted Tree Augmentation admits several 2-approximation algorithms w.r.t. the standard cut-LP ...

متن کامل

An LP 7/4-approximation for the Tree Augmentation Problem

In the Tree Augmentation Problem (TAP) the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪ F is 2-edge-connected. The best known approximation ratio for the problem is 1.5 [5, 12]. Several paper analysed integrality gaps of LP and SDP relaxations for the problem. In [13] is given a simple LP with gap 1.5 for the case when every edge in E connects t...

متن کامل

Improved Approximation for Weighted Tree Augmentation with Bounded Costs

The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree G = (V,E), an additional set of edges L ⊆ V × V disjoint from E called links, and a cost vector c ∈ R≥0, WTAP asks to find a minimum-cost set F ⊆ L with the property that (V,E ∪ F ) is 2-edge connected. The special case where c` = 1 for all ` ∈ L is called...

متن کامل

A $\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chv\'atal-Gomory Cuts

The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree G = (V,E), an additional set of edges L called links and a cost vector c ∈ RL≥1. The goal is to choose a minimum cost subset S ⊆ L such that G = (V,E ∪ S) is 2-edge-connected. In the unweighted case, that is, when we have cl = 1 for all l ∈ L, the problem is called the tree aug...

متن کامل

Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem

In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can restrict our attention to trees which are binary and where all the non-tree edges go between two leaves of the tree. We then give two different top-down coloring...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1507.03009  شماره 

صفحات  -

تاریخ انتشار 2015